Erdös-Rényi Random Graphs: Warm Up
نویسنده
چکیده
In this lecture we will introduce the Erdös-Rényi model of random graphs. Erdös and Rényi did not introduce them in an attempt to model any graphs found in the real world. Rather, they introduced them because they are the source of a lot of interesting mathematics. In fact, these random graphs have many properties that we do not know how to obtain through any efficient explicit construction of graphs. They are also the source of many graphs having counter-intuitive properties. Over the next two lectures, will see that Erdös-Rényi random graphs have many properties in common with graphs encountered in the real world, and many properties that are very different. We study these graphs for three reasons:
منابع مشابه
Erdös-Rényi Random Graphs: The Giant Component
Recall that all the “Real-World” graphs we examined in Lecture 2 had one component containing a large constant fraction of the vertices. The second-largest component was smaller by many orders of magnitude. This property is shared by Erdös-Rényi random graphs and by many other graph models. In this lecture, we will see (mostly) why Erdös-Rényi random graphs have this property. The large compone...
متن کاملJigsaw Percolation on Erdös-rényi Random Graphs
We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdös-Rényi random graphs. Let pppl and ppuz denote the probability that an edge exists in the respective people and puzzle graphs and define peff = ppplppuz, the effective probability. We show for constants c1 > 1 and c2 > π /6 and c3 < e −5 if min(pppl, ppuz) > c1 logn/n the critical ef...
متن کاملOn large deviation properties of Erdös-Rényi random graphs
It is well-known that typical properties of random graphs can be derived from the q → 1 limit of the Potts model of statistical mechanics. We show that, additionally, the Legendre transform of the Potts free energy with respect to ln q allows to study large deviation properties of the random graph ensemble characterizing graphs with an atypical number of components. We also demonstrate how the ...
متن کاملSynchronization in Generalized Erdös-Rényi Networks of Nonlinear Oscillators
In this paper, we study synchronization of complex random networks of nonlinear oscillators, with specifiable expected degree distribution. We review a sufficient condition for synchronization and a sufficient condition for desynchronization, expressed in terms of the eigenvalue distribution of the Laplacian of the graph and the coupling strength. We then provide a general way to approximate th...
متن کاملConcentration of measure for the number of isolated vertices in the Erdös-Rényi random graph by size bias couplings
Let Y be a nonnegative random variable with mean μ and let Y , defined on the same space as Y , have the Y -size biased distribution, that is, the distribution characterized by E[Y f(Y )] = μE[f(Y )] for all functions f for which these expectations exist. The size bias coupling of Y to Y s can be used to obtain the following concentration of measure result when Y counts the number of isolated v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010